| 1. Identity statement | ||||
| Reference Type | Conference Paper (Conference Proceedings) | |||
| Site | sibgrapi.sid.inpe.br | |||
| Holder Code | ibi 8JMKD3MGPEW34M/46T9EHH | |||
| Identifier | 8JMKD3MGPBW34M/3A35MF5 | |||
| Repository | sid.inpe.br/sibgrapi/2011/07.07.15.14 | |||
| Last Update | 2011:07.07.15.14.55 (UTC) administrator | |||
| Metadata Repository | sid.inpe.br/sibgrapi/2011/07.07.15.14.55 | |||
| Metadata Last Update | 2022:06.14.00.07.09 (UTC) administrator | |||
| DOI | 10.1109/SIBGRAPI.2011.25 | |||
| Citation Key | NakamuraPerePapaFalc:2011:OpFoPr | |||
| Title | Optimum-path forest pruning parameter estimation through harmony search  | |||
| Format | DVD, On-line. | |||
| Year | 2011 | |||
| Access Date | 2024, Apr. 30 | |||
| Number of Files | 1 | |||
| Size | 199 KiB | |||
| 2. Context | ||||
| Author | 1 Nakamura, Rodrigo Yuji Mizobe 2 Pereira, Clayton Reginaldo 3 Papa, Joao Paulo 4 Falcao, Alexandre Xavier | |||
| Affiliation | 1 UNESP - Univ Estadual Paulista 2 UNESP - Univ Estadual Paulista 3 UNESP - Univ Estadual Paulista 4 University of Campinas | |||
| Editor | Lewiner, Thomas Torres, Ricardo | |||
| e-Mail Address | papa.joaopalo@gmail.com | |||
| Conference Name | Conference on Graphics, Patterns and Images, 24 (SIBGRAPI) | |||
| Conference Location | Maceió, AL, Brazil | |||
| Date | 28-31 Aug. 2011 | |||
| Publisher | IEEE Computer Society | |||
| Publisher City | Los Alamitos | |||
| Book Title | Proceedings | |||
| Tertiary Type | Full Paper | |||
| History (UTC) | 2011-07-23 15:36:12 :: papa.joaopalo@gmail.com -> administrator :: 2011 2022-06-14 00:07:09 :: administrator -> :: 2011 | |||
| 3. Content and structure | ||||
| Is the master or a copy? | is the master | |||
| Content Stage | completed | |||
| Transferable | 1 | |||
| Version Type | finaldraft | |||
| Keywords | Optimum-Path Forest Supervised classification Pattern Recognition | |||
| Abstract | Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. | |||
| Arrangement 1 | urlib.net > SDLA > Fonds > SIBGRAPI 2011 > Optimum-path forest pruning... | |||
| Arrangement 2 | urlib.net > SDLA > Fonds > Full Index > Optimum-path forest pruning... | |||
| doc Directory Content | access | |||
| source Directory Content | there are no files | |||
| agreement Directory Content |
| |||
| 4. Conditions of access and use | ||||
| data URL | http://urlib.net/ibi/8JMKD3MGPBW34M/3A35MF5 | |||
| zipped data URL | http://urlib.net/zip/8JMKD3MGPBW34M/3A35MF5 | |||
| Language | en | |||
| Target File | final_paper.pdf | |||
| User Group | papa.joaopalo@gmail.com | |||
| Visibility | shown | |||
| 5. Allied materials | ||||
| Mirror Repository | sid.inpe.br/banon/2001/03.30.15.38.24 | |||
| Next Higher Units | 8JMKD3MGPEW34M/46SKNPE 8JMKD3MGPEW34M/4742MCS | |||
| Citing Item List | sid.inpe.br/sibgrapi/2022/05.15.00.56 4 | |||
| Host Collection | sid.inpe.br/banon/2001/03.30.15.38 | |||
| 6. Notes | ||||
| Empty Fields | archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume | |||